Some preconditioners for systems of linear inequalities

نویسندگان

  • Javier Peña
  • Vera Roshchina
  • Negar Soheili
چکیده

We show that a combination of two simple preprocessing steps would generally improve the conditioning of a homogeneous system of linear inequalities. Our approach is based on a comparison among three different but related notions of conditioning for linear inequalities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the modified iterative methods for $M$-matrix linear systems

This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

متن کامل

Fast Randomized Algorithms for Partitioning , Sparsification , and Solving Linear Systems

4 Combinatorial Preconditioners 6 4.1 Graphic Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Graphic Inequalities with Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Augmented Tree Preconditioners . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Sparsifying . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Linear optimization on Hamacher-fuzzy relational inequalities

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...

متن کامل

Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods

In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...

متن کامل

A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization

We propose a class of preconditioners for large positive definite linear systems, arising in nonlinear optimization frameworks. These preconditioners can be computed as by-product of Krylovsubspace solvers. Preconditioners in our class are chosen by setting the values of some user-dependent parameters. We first provide some basic spectral properties which motivate a theoretical interest for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2014